Adjacency-Based Data Reordering Algorithm for Acceleration of Finite Element Computations

Adjacency-based data reordering algorithm for acceleration of finite element computations

Effective use of the processor memory hierarchy is an important issue in high performance computing. In this work, a part level mesh topological traversal algorithm is used to define a reordering of both mesh vertices and regions that increases the spatial locality of data and improves overall cache utilization during on processor finite element calculations. Examples based on adaptively create...

implementation of the skyline algorithm in finite-element computations of saint-venant equations

solving a large sparse set of linear equations is of the problems widely seen in every numerical investigation in the entire range of engineering disciplines. employing a finite element approach in solving partial derivative equations, the resulting stiffness matrices would contain many zero-valued elements. moreover, storing all these sparse matrices in a computer memory would slower the compu...

A compact adjacency-based topological data structure for finite element mesh representation

This paper presents a novel compact adjacency-based topological data structure for finite element mesh representation. The proposed data structure is designed to support, under the same framework, both twoand three-dimensional meshes, with any type of elements defined by templates of ordered nodes. When compared to other proposals, our data structure reduces the required storage space while bei...

An Algorithm for Finite Element Analysis of Tunnel Supports Based on the Winkler’s Theory

An Algorithm for Finite Element Analysis of Tunnel Supports Based on the Winkler’s Theory